Review of “Jack, Hall-Littlewood and Macdonald polynomials”, V. B. Kuznetsov and S. Sahi (eds.)
نویسندگان
چکیده
The book under review contains the Proceedings of a Workshop held in 2003 in Edinburgh, UK. This workshop paid attention to (in fact, celebrated) the pioneering work by the mathematicians Henry Jack, Philip Hall and D. E. Littlewood on two new families of symmetric polynomials, and to the magnificent job done by Ian Macdonald to bring these two classes of polynomials together in a more general family of symmetric polynomials. But most lectures described new developments involving these polynomials. Jack, Hall and Littlewood all lived and worked in England, Scotland or Wales, as does Macdonald, so it was very appropriate to hold this workshop in the UK. The remarkable story about the life and work of these four people fills the first 125 pages of the volume. The remaining two third of the volume is filled with 13 papers describing recent research. All authors of the research papers have earlier made important contributions to the development of the subject. I will pay most attention in this review to the first, historical part of the Volume. It contains short biographies of the four main characters, reprints of the original papers introducing the various polynomials, including an unpublished manuscript by Jack followed by comments by Macdonald. Some relevant letters are also included. It is striking to read in the biographies about the isolation of Jack, Hall and Littlewood. Jack was a Reader in Dundee, Scotland. He never ventured far from Scotland and he did not attend conferences (except for ICM, Amstrdam, 1954). Hall was the only algebrist in Cambridge. He was reticent and cared little for large gatherings. Littlewood was a full professor in Bangor, Wales. He also kept away from mathematical meetings. He never met Hall. Eventually he stopped publishing because “there is no point in writing papers of which nobody takes any notice”.
منابع مشابه
Combinatorial theory of Macdonald polynomials I: proof of Haglund's formula.
Haglund recently proposed a combinatorial interpretation of the modified Macdonald polynomials H(mu). We give a combinatorial proof of this conjecture, which establishes the existence and integrality of H(mu). As corollaries, we obtain the cocharge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a formula of Sahi and Knop for Jack's symmetric functions, a generalization o...
متن کاملA Combinatorial Formula for Macdonald Polynomials
The Macdonald polynomials H̃μ(x; q, t) have been the subject of much attention in combinatorics since Macdonald [25] defined them and conjectured that their expansion in terms of Schur polynomials should have positive coefficients. Macdonald’s conjecture was proven in [11] by geometric and representation-theoretic means, but these results do not provide any purely combinatorial interpretation fo...
متن کاملeb 2 00 4 Inversion of the Pieri formula for Macdonald polynomials
We give the explicit analytic development of Macdonald polynomials in terms of “modified complete” and elementary symmetric functions. These expansions are obtained by inverting the Pieri formula. Specialization yields similar developments for monomial, Jack and Hall–Littlewood symmetric functions. ∗The second author was fully supported by an APART fellowship of the Austrian Academy of Sciences...
متن کاملBinomial Coefficients and Littlewood–Richardson Coefficients for Jack Polynomials
In this paper, we consider translation and multiplication operators acting on the rings of symmetric and nonsymmetric polynomials and study their matrix coefficients with respect to the bases of Jack polynomials and interpolation polynomials. The main new insight is that the symmetric and nonsymmetric cases share a key combinatorial feature, that of a locally finite graded poset with a minimum ...
متن کاملInterpolation, Integrality, and a Generalization of Macdonald's Polynomials
For q = 0 and q = t, one gets the Hall-Littlewood polynomial Pλ(x; t) and the Schur polynomial sλ, respectively, while limt→1 Pλ(x; t, t) yields the Jack polynomial P λ (x). Our first result is a generalization of Pλ(x;q, t) to n “t-parameters.” Thus let τ = (τ1, . . . , τn) be indeterminates, and put F = Q(q, τ). If μ is a partition, write q−μτ for the n-tuple (q−μ1τ1, . . . , q−μnτn). We show...
متن کامل